322,06 €
378,89 €
Computers and Intractability
Computers and Intractability
322,06 €
378,89 €
  • Išsiųsime per 10–14 d.d.
In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an influential textbook by Michael Garey and David S. Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it doe…
322.06 2025-07-06 23:59:00
  • Autorius: M R Garey
  • Leidėjas:
  • ISBN-10: 0716710455
  • ISBN-13: 9780716710455
  • Formatas: 16.9 x 23.3 x 1.7 cm, minkšti viršeliai
  • Kalba: Anglų
  • Extra -15 % nuolaida šiai knygai su kodu: ENG15

Computers and Intractability + nemokamas atvežimas! | knygos.lt

Atsiliepimai

(4.14 Goodreads įvertinimas)
Įvertink ir tu! Visi atsiliepimai

Aprašymas

In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an influential textbook by Michael Garey and David S. Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.

EXTRA 15 % nuolaida

NEMOKAMAS PRISTATYMAS
322,06 €
378,89 €
Išsiųsime per 10–14 d.d.

Kupono kodas: ENG15

Akcija baigiasi už 6d.03:09:07

Nuolaidos kodas galioja perkant nuo 10 €. Nuolaidos nesumuojamos.

Prisijunkite ir už šią prekę
gausite 3,79 Knygų Eurų!?
Įsigykite dovanų kuponą
Daugiau

In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an influential textbook by Michael Garey and David S. Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.

Atsiliepimai

  • Atsiliepimų nėra
0 pirkėjai įvertino šią prekę.
5
0%
4
0%
3
0%
2
0%
1
0%
[{"option":"58","probability":13,"style":{"backgroundColor":"#f3f3f3"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/685e599c86b351751013788.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"57","probability":14,"style":{"backgroundColor":"#e31e30"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/685e5981e89e41751013761.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"56","probability":15,"style":{"backgroundColor":"#f3f3f3"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/685e59691dc2d1751013737.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"55","probability":14,"style":{"backgroundColor":"#e31e30"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/685e590bade881751013643.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"54","probability":15,"style":{"backgroundColor":"#f3f3f3"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/685e58f20a7761751013618.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"53","probability":14,"style":{"backgroundColor":"#e31e30"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/685e58d20c1ee1751013586.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"52","probability":14.5,"style":{"backgroundColor":"#f3f3f3"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/685e58b358b2e1751013555.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"51","probability":0.5,"style":{"backgroundColor":"#e31e30"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/685e57cded6da1751013325.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}}]